A Meshalkin Theorem for Projective Geometries1
نویسنده
چکیده
Let M be a family of sequences (a1, . . . , ap) where each ak is a flat in a projective geometry of rank n (dimension n− 1) and order q, and the sum of ranks, r(a1)+ · · ·+ r(ap), equals the rank of the join a1 ∨ · · · ∨ ap. We prove upper bounds on |M| and corresponding LYM inequalities assuming that (i) all joins are the whole geometry and for each k < p the set of all ak’s of sequences in M contains no chain of length l, and that (ii) the joins are arbitrary and the chain condition holds for all k. These results are q-analogs of generalizations of Meshalkin’s and Erdős’s generalizations of Sperner’s theorem and their LYM companions, and they generalize Rota and Harper’s q-analog of Erdős’s generalization.
منابع مشابه
A Meshalkin theorem for projective geometries
LetM be a family of sequences (a1, . . . , ap) where each ak is a flat in a projective geometry of rank n (dimension n− 1) and order q, and the sum of ranks, r(a1)+ · · ·+ r(ap), equals the rank of the join a1 ∨ · · · ∨ ap. We prove upper bounds on |M| and corresponding LYM inequalities assuming that (i) all joins are the whole geometry and for each k < p the set of all ak’s of sequences in M c...
متن کاملA Shorter, Simpler, Stronger Proof of the Meshalkin–Hochberg–Hirsch Bounds on Componentwise Antichains1
Meshalkin’s theorem states that a class of ordered p-partitions of an n-set has at most max ( n a1,...,ap ) members if for each k the k parts form an antichain. We give a new proof of this and the corresponding LYM inequality due to Hochberg and Hirsch, which is simpler and more general than previous proofs. It extends to a common generalization of Meshalkin’s theorem and Erdős’s theorem about ...
متن کاملSharpening the LYM inequality
More detailed information about the s t ructure of Sperner families can be obtained by considering their level sequences. The level sequence of a family 4 , f ( ~ ) = {fi(Y)}, has f i (~) equal to the number of members of ~ with exac t ly ' / e l emen t s . Sperner 's theorem asserts tha t ~fi(2~)<_ ([~j) . A stronger restriction on the level i sequence was proved independent ly by Lubell, Yama...
متن کاملA Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains
Meshalkin’s theorem states that a class of ordered p-partitions of an n-set has at most max ( n a1,...,ap ) members if for each k the k parts form an antichain. We give a new proof of this and the corresponding LYM inequality due to Hochberg and Hirsch, which is simpler and more general than previous proofs. It extends to a common generalization of Meshalkin’s theorem and Erdős’s theorem about ...
متن کاملPermutation codes, source coding and a generalisation of Bollobás-Lubell-Yamamoto-Meshalkin and Kraft inequalities
We develop a general framework to prove Krafttype inequalities for prefix-free permutation codes for source coding with various notions of permutation code and prefix. We also show that the McMillan-type converse theorem in most of these cases does not hold, and give a general form of a counterexample. Our approach is more general and works for other structures besides permutation codes. The cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008